Algorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting
نویسندگان
چکیده
Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the execution steps of encoding and decoding are presented. Finally, we manifest the implement procedure.
منابع مشابه
Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملUPFC Placement and Setting Optimized for Multi-objective Optimization Methods to Solve IPOPT in Pool Market
Abstract: Unified Power Flow Controller (UPFC) is one of the FACTS devices which plays a crucial role in simultaneous regulating active and reactive power, improving system load, reducing congestion and cost of production. Therefore, determining the optimum location of such equipment in order to improve the performance of the network is significant. In this paper, WCA algorithm is used to locat...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملElectromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...
متن کامل